package com.example.leetcode.graph;

import com.example.leetcode.graph.common.GraphUtils;

class Solution787 {
    public int findCheapestPrice(int n, int[][] flights, int src, int dst, int k) {
//        return GraphUtils.findCheapestPrice(n, flights, src, dst, k);
        return GraphUtils.findCheapestPrice1(n, flights, src, dst, k);
    }
}

public class leetcode787 {
    public static void main(String[] args) {
        Solution787 solution787 = new Solution787();

        int[][] edges = {
                {0, 1, 100},
                {1, 2, 100},
                {0, 2, 500}};

//        System.out.println(solution787.findCheapestPrice(3, edges, 0, 2, 1));

        int[][] edges1 = {
                {1, 0, 5}
        };
        System.out.println(solution787.findCheapestPrice(2, edges1, 0, 1, 1));
    }
}
